On additive co-minimal pairs
نویسندگان
چکیده
A pair of non-empty subsets (W,W?) in an abelian group G is additive complement if W+W?=G. The set W? said to be minimal W W+(W??{w?})?G,?w??W?. In general, given arbitrary subset a group, the existence complement(s) depends on its structure. dual problem asks that such set, it some subset. Additive complements have been studied context representations integers since time Erd?s, Hanani, Lorentz and others. notion due Nathanson. We study tightness property pairs both are each other. These termed co-minimal we show any finite free belongs pair. also infinite sets forming pairs. At other extreme, motivated by unbounded arithmetic progressions integers, look at which can never part This leads discussion co-minimality, subgroups, approximate subgroups asymptotic G.
منابع مشابه
The Effect of L2 Minimal Pairs Practice on Iranian Intermediate EFL Learners’ Pronunciation Accuracy
The aim of the current study was to investigate whether L2 minimal pairs practice would have an effect on Iranian intermediate EFL learners’ pronunciation accuracy. For this purpose, 30 Iranian intermediate EFL learners at Simin institute participated in the experiment of the study. The selection of subjects was done from among 150 EFL learners at intermediate level. In order to make subj...
متن کاملHighness and Bounding Minimal Pairs
We show the existence of a high r.e. degree bounding only joins of minimal pairs and of a high2 nonbounding r.e. degree.
متن کاملLearning Phonemes Without Minimal Pairs
The question addressed by this research is how humans acquire the internalized, mental categories that reflect the phonemes of their language. That humans have such categories is evidenced by the fact that, for example, English speakers immediately recognize pear and bear as being different words. This immediate realization is independent of the fact that these two words have different meanings...
متن کاملConstructing Minimal Pairs of Degrees
We prove that there exist sets of natural numbers A and B such that A and B form a minimal pair with respect to Turing reducibility, enumeration reducibility, hyperarithmetical reducibility and hyperenumer-ation reducibility. Relativized versions of this result are presented as well. 1. Introduction In the present paper we consider four kinds of reducibilities among sets of natural numbers: Tur...
متن کاملMinimal Pairs in the C
Strong reducibilities such as the m-reducibility have been around implicitly, if not explicitly, since the dawn of computability theory. The explicit recognition of the existence of differing kinds of oracle access mechanisms began with the seminal work of Post [12]. Of interest to us from Post’s paper are the so-called tabular reducibilities ≤tt, truth table reducibility, and ≤wtt, weak truth ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 2021
ISSN: ['0022-314X', '1096-1658']
DOI: https://doi.org/10.1016/j.jnt.2020.10.010